Paraconsistent Reasoning Based on Strong Relevant Logic
نویسنده
چکیده
1 This work is supported in part by The Ministry of Education, Culture, Sports, Science and Technology of Japan under Grant-in-Aid for Exploratory Research No. 09878061 and Grant-in-Aid for Scientific Research (B) No. 11480079. Abstract. Both a body of human knowledge and a knowledge/information system may be incomplete and inconsistent in many ways. Reasoning with incomplete and inconsistent knowledge/information is the rule rather than the exception in our everyday real-life situations and most scientific disciplines. Paraconsistent reasoning, or reasoning in the presence of inconsistency, is indispensable to scientific discovery. This paper intends to answer such a fundamental question: What kind of logic system can satisfactorily underlie paraconsistent reasoning in scientific discovery? We show why classical mathematical logic, its various classical conservative extensions, and traditional (weak) relevant logics cannot satisfactorily underlie paraconsistent reasoning in scientific discovery, and propose that one should adopt strong relevant logic as the fundamental logic to underlie paraconsistent reasoning in scientific discovery.
منابع مشابه
Formula-Preferential Systems for Paraconsistent Non-Monotonic Reasoning
We provide a general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning. The framework is based on preferential systems whose preferences are based on the satisfaction of formulas in models. The framework encompasses different types of preferential systems that were developed from different motivations of paraconsistent reasoning and...
متن کاملFormula - Preferential Systems for Paraconsistent Non - Monotonic Reasoning ( an extended
We provide a general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning. The framework is based on preferential systems whose preferences are based on the satisfaction of formulas in models. The framework encompasses different types of preferential systems that were developed from different motivations of paraconsistent reasoning and...
متن کاملPStable Semantics for Possibilistic Logic Programs
Uncertain information is present in many real applications e.g., medical domain, weather forecast, etc. The most common approaches for leading with this information are based on probability however some times; it is difficult to find suitable probabilities about some events. In this paper, we present a possibilistic logic programming approach which is based on possibilistic logic and PStable se...
متن کاملA Formula-Preferential Base for Paraconsistent and Plausible Reasoning Systems
We provide a general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning. The framework is based on preferential systems whose preferences are based on the satisfaction of formulas in models. We show that these natural preferential systems that were originally designed for paraconsistent reasoning fulfill a key condition (stopperednes...
متن کاملParaconsistent Computation Tree Logic Paraconsistent Computation Tree Logic * 1
It is known that paraconsistent logical systems are more appropriate for inconsistency-tolerant and uncertainty reasoning than other types of logical systems. In this paper, a paraconsistent computation tree logic, PCTL, is obtained by adding paraconsistent negation to the standard computation tree logic CTL. PCTL can be used to appropriately formalize inconsistency-tolerant temporal reasoning....
متن کامل